dald:-distributed-asynchronous-local-decontamination algorithm in arbitrary graphs

network environments always can be invaded by intruder agents. in networks where nodes are performing some computations, intruder agents might contaminate some nodes. therefore, problem of decontaminating a network infected by intruder agents is one of the major problems in these networks. in this paper, we present a distributed asynchronous local algorithm for decontaminating a network. in most of prior algorithms, there is a coordinator agent that starts from a node and decontaminates the network. since this procedure is handled by an agent and in centralized mode decontamination algorithm is very slow. in our algorithm, the network is decomposed to some clusters and a coordinator is advocated to each cluster. therefore, there is more than one coordinator that each of them starts from different nodes in the network and decontaminates network, independently. in this case, network is decontaminated faster. in addition, in previous works the upper bound of the number of moves and the number of cleaner agents required to decontaminate network are given only for networks with special structures such as ring or tori while our algorithm establishes these upper bounds on networks with arbitrary structure.